Pointwise stabilization of discrete-time matrix-valued stationary Markov chains

نویسندگان

  • Xiongping Dai
  • Yu Huang
  • Mingqing Xiao
چکیده

Let (Ω,F ,P) be a probability space and S = {S1, . . . , SK} a discrete-topological space that consists of K real d-by-d matrices, where K and d both ≥ 2. In this paper, we study the pointwise stabilizability of a discrete-time, time-homogeneous, stationary (p, P)-Markovian jump linear system Ξ = (ξn) n=1 where ξn : Ω → S. Precisely, Ξ is called “pointwise convergent”, if to any initial state x0 ∈ R1×d, there corresponds a measurable set Ωx0 ⊂ Ω with P(Ωx0) > 0 such that x0 ∏n l=1 ξl(ω) → 01×d as n → +∞, ∀ω ∈ Ωx0 ; and Ξ is said to be “pointwise exponentially convergent”, if to any initial state x0 ∈ R1×d, there corresponds a measurable set Ωx0 ⊂ Ω with P(Ω ′ x0) > 0 such that x0 ∏n l=1 ξl(ω) exponentially fast −−−−−−−−−−−−→ 01×d as n → +∞, ∀ω ∈ Ωx0 . Using dichotomy, we show that if Ξ is product bounded, i.e., ∃β > 0 such that ‖ ∏n l=1 ξl(ω)‖2 ≤ β ∀n ≥ 1 and P-a.e. ω ∈ Ω; then Ξ is pointwise convergent if and only if it is pointwise exponentially convergent.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pointwise Stabilization of Discrete-time Stationary Matrix-valued Markovian Chains

Let (Ω,F ,P) be a probability space and S = {S1, . . . , SK} a discrete-topological space that consists of K real d-by-d matrices, where K and d both ≥ 2. In this paper, we study the pointwise stabilizability of a discrete-time, time-homogeneous, stationary (p, P)-Markovian jump linear system Ξ = (ξn) n=1 where ξn : Ω → S. Precisely, Ξ is called “pointwise convergent”, if to any initial state x...

متن کامل

Stationary Probabilities of Markov Chains

In this paper, based on probabilistic arguments, we obtain an explicit solution of the stationary distribution for a discrete time Markov chain with an upper Hessenberg time stationary transition probability matrix. Our solution then leads to a numerically stable and eecient algorithm for computing stationary probabilities. Two other expressions for the stationary distribution are also derived,...

متن کامل

Stationary Probabilities of Markov Chains with Upper Hessenberg Transition Matrices

In this paper, based on probabilistic arguments, we obtain an explicit solution of the stationary distribution for a discrete time Markov chain with an upper Hessenberg time stationary transition probability matrix. Our solution then leads to a numerically stable and efficient algorithm for computing stationary probabilities. Two other expressions for the stationary distribution are also derive...

متن کامل

Markov Chains with Hybrid Repeating Rows – Upper-hessenberg, Quasi-toeplitz Structure of the Block Transition Probability Matrix

In this paper we consider discrete-time multidimensional Markov chains having a block transition probability matrix which is the sum of a matrix with repeating block rows and a matrix of upper-Hessenberg, quasi-Toeplitz structure. We derive sufficient conditions for the existence of the stationary distribution, and outline two algorithms for calculating the stationary distribution.

متن کامل

Limitations on intermittent forecasting

Bailey showed that the general pointwise forecasting for stationary and ergodic time series has a negative solution. However, it is known that for Markov chains the problem can be solved. Morvai showed that there is a stopping time sequence {λ n } such that P (X λn+1 =) such that the difference between the conditional probability and the estimate vanishes along these stoppping times for all sta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1107.0132  شماره 

صفحات  -

تاریخ انتشار 2011